William Phelps Allis

Using ALLiS for clausing

Using Allis for Clausing

We present the result of a symbolic machine learning system, ALLiS 2.0 for the CoNLL-2001 shared task. ALLiS 2.0 is a theory reenement system using hierarchical data. Results are F=89.04 for subtask 1, F=68.02 for subtask 2 and F=67.70 for subtask 3 (development test). Adding manual rules improves considerably results specially for task 2 (F=79.44). For the test data, results are slightly worst...

On the Phelps-Koopmans theorem

We examine whether the Phelps–Koopmans theorem is valid in models with nonconvex production technologies. We argue that a nonstationary path that converges to a capital stock above the smallest golden rule may indeed be efficient. This finding has the important implication that “capital overaccumulation” need not always imply inefficiency. Under mild regularity and smoothness assumptions, we pr...

The Phelps–Koopmans theorem and potential optimality

The Phelps–Koopmans theorem states that if every limit point of a path of capital stocks exceeds the “golden rule,” then that path is inefficient: there is another feasible path from the same initial stock that provides at least as much consumption at every date and strictly more consumption at some date. I show that in a model with nonconvex technologies and preferences, the theorem is false i...

SQS-graphs of Solov'eva-Phelps codes

A binary extended 1-perfect code C folds over its kernel via the Steiner quadruple systems associated with its codewords. The resulting folding, proposed as a graph invariant for C, distinguishes among the 361 nonlinear codes C of kernel dimension κ obtained via Solov’eva-Phelps doubling construction, where 9 ≥ κ ≥ 5. Each of the 361 resulting graphs has most of its nonloop edges expressible in...